An Architecture for Provisioning In-Network Computing-Enabled Slices for Holographic Applications in Next-Generation Networks

Applications such as holographic concerts are now emerging. However, their provisioning remains highly challenging. Requirements such as high bandwidth and ultra-low latency are still very challenging for the current network infrastructure. In-network computing (INC) is an emerging paradigm that enables the distribution of computing tasks across the network instead of computing on servers outside the network. It aims at tackling these two challenges. This article advocates the use of the INC paradigm to tackle holographic applications' high bandwidth and low latency challenges instead of the edge computing paradigm that has been used so far. Slicing brings flexibility to next-generation networks by enabling the deployment of applications/verticals with different requirements on the same network infrastructure. We propose an architecture that enables the provisioning of INC-enabled slices for holographic-type application deployment. The architecture is validated through a proof of concept and extensive simulations. Our experimental results show that INC significantly outperforms edge computing when it comes to these two key challenges. In addition, low jitter was maintained to preserve the hologram's stability

Ensuring Reliability and Low Cost When Using a Parallel VNF Processing Approach to Embed Delay-Constrained Slices

© 2004-2012 IEEE. Slices were introduced in 5G to enable the co-existence of applications with different requirements on a single infrastructure. Slices may be delay-constrained for mission-critical applications such as Tactile Internet applications. When delay-constrained slices are implemented as collections of virtual network function (VNF) chains, a key challenge is to place the VNFs and route the traffic through the chains to meet a strict delay constraint. Parallel VNF processing has been proposed as a promising approach. However, this approach increases the number of physical nodes in the chains, and thus decreases the reliability, which is also critical for Tactile Internet applications. Furthermore, the cost depends upon the specific VNF placement and traffic routing, as nodes and links are heterogeneous. This article tackles the issues of reliability and cost when embedding delay-constrained slices. We model the problem as an optimization problem that minimizes reliability degradation and cost while ensuring the strict delay constraint when a parallel VNF processing approach is used. Due to the complexity of the formulated problem, we also propose a Tabu search-based algorithm to find sub-optimal solutions. The results indicate that our proposed algorithm can significantly improve cost and reliability while meeting a strict delay constraint

A quitting game framework for self-organized D2D mobile relaying in 5G

Abstract Offloading the network, minimizing the power consumption as well as reducing interference are important issues in wireless networks. These requirements mandates that future cellular networks need to use Device-to-Device communication as a key enabler. To harness this solution, we propose a two-device system that combines cellular and Device-to-Device (D2D) communication in an uplink communication. We model this system as a quitting game where devices choose simultaneously either to continue or to quit transmitting over the cellular network. The devices will strategically choose whether to compete or to cooperate through mobile relaying. We first calculate the throughput and the outage probability in a fading channel, then we find the Sub-game Perfect Equilibrium of this game by determining the pure and mixed Nash equilibrium of each subgame. Results show that the outage probability depends on the transmission power and the distance separating a device from its serving BS. The quitting decision of devices depends on the fraction of throughput they would get after quitting, on the quitting frame and on the quitting regret